Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graphe linéaire")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 269

  • Page / 11
Export

Selection :

  • and

The spectral dimension of random brushesJONSSON, Thordur; ÖRN STEFANSSON, Sigurour.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 4, issn 1751-8113, 045005.1-045005.10Article

The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

Hypernetworks as tools for modelling multiport systemsGATTINGER, M; WENZEL, G.Journal of the Franklin Institute. 1984, Vol 37, Num 1, pp 1-6, issn 0016-0032Article

A comparative analysis of the performance of Taguchi's linear graphs for the design of two-level fractional factorialsBISGAARD, S.Applied statistics. 1996, Vol 45, Num 3, pp 311-322, issn 0035-9254Article

A geometric growth model interpolating between regular and small-world networksZHONGZHI ZHANG; SHUIGENG ZHOU; ZHIYONG WANG et al.Journal of physics. A, Mathematical and theoretical (Print). 2007, Vol 40, Num 39, pp 11863-11876, issn 1751-8113, 14 p.Article

ON THE GENERATION OF K-TREESFIDLER JK; HORROCKS DM.1973; INTERNATION. J. ELECTRON.; G.B.; DA. 1973; VOL. 34; NO 2; PP. 185-187; BIBL. 4 REF.Serial Issue

GENERATION OF TREES, COTREES AND 2-TREES OF A LINEAR GRAPHCAHIT R; CAHIT I.1972; PROC. INSTIT. ELECTR. ENGRS; G.B.; DA. 1972; VOL. 119; NO 9; PP. 1275-1277; BIBL. 19 REF.Serial Issue

ON LISTING LINEAR GRAPHS.MCKENZIE DS; MCKENZIE S.1975; J. PHYS. A; G.B.; DA. 1975; VOL. 8; NO 11; PP. 1755-1760; BIBL. 11 REF.Article

ON A TEST FOR ISOMORPHISM OF LINEAR GRAPHS ASSOCIATED WITH EXPERIMENTAL DESIGNS.MASUYAMA M.1974; SANKHYA, A; INDIA; DA. 1974; VOL. 36; NO 1; PP. 53-62; BIBL. 5 REF.Article

THE PROOF OF, AND GENERALIZATIONS TO, A CONJECTURE BY BAKER AND ESSAMCARDY S.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 2; PP. 101-122; BIBL. 6 REF.Serial Issue

ANWENDUNG GRAPHENTHEORETISCHER VERFAHREN IN DER ENTSCHEIDUNGSTABELLENTECHNIK. = APPLICATION DES METHODES DE LA THEORIE DES GRAPHES DANS LA TECHNIQUE DES TABLES DE DECISIONSTURNZ H; JORGENSEN PC.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; NO 2; PP. 65-73; ABS. ANGL.; BIBL. 4 REF.Article

THE DESCRIPTION AND GROUP PROPERTIES OF LINEAR GRAPHS.MCKENZIE DS.1975; J. PHYS. A; G.B.; DA. 1975; VOL. 8; NO 11; PP. 1746-1754; BIBL. 9 REF.Article

ON THE NUMBER OF CERTAIN HAMILTON CIRCUITS OF A COMPLETE GRAPHBAROTI G.1973; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1973; VOL. 3; NO 1-2; PP. 135-139; BIBL. 9 REF.Serial Issue

LINEAR FUZZY GRAPHSROUBENS M; VINCKE P.1983; FUZZY SETS AND SYSTEMS; ISSN 0165-0114; NLD; DA. 1983; VOL. 10; NO 1; PP. 79-86; BIBL. 13 REF.Article

LINE PERFECT GRAPHS.TROTTER LE JR.1977; MATH. PROGRAMMG; NETHERL.; DA. 1977; VOL. 12; NO 2; PP. 255-259; BIBL. 17 REF.Article

Pre-processing and linear-decomposition algorithm to solve the k-colorability problemLUCET, Corinne; MENDES, Florence; MOUKRIM, Aziz et al.Lecture notes in computer science. 2004, pp 315-325, issn 0302-9743, isbn 3-540-22067-4, 11 p.Conference Paper

Ferromagnetic ground states for the Hubbard model on line graphsMIELKE, A.Journal of physics. A, mathematical and general. 1991, Vol 24, Num 2, pp L73-L77, issn 0305-4470Article

Taguchi methods: linear graphs of high resolutionCZITROM, V.Communications in statistics. Theory and methods. 1989, Vol 18, Num 12, pp 4583-4606, issn 0361-0926Article

On distance-preserving and domination elimination orderingsCHEPOI, V.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 3, pp 414-436, issn 0895-4801Article

Analysis of dynamic behaviour for power transmission mechanism using linear graph theoryWATANUKI, K; OHTAKI, H; ISHIKAWA, Y et al.SAE transactions. 1987, Vol 96, Num 3, pp 1176-1183, issn 0096-736XArticle

An O(n) time algorithm for maximum matching in P4-tidy graphsFOUQUET, J. L; PARFENOFF, I; THUILLIER, H et al.Information processing letters. 1997, Vol 62, Num 6, pp 281-287, issn 0020-0190Article

More on rectangles tiles by rectanglesMEAD, D. G; STEIN, S. K.The American mathematical monthly. 1993, Vol 100, Num 7, pp 641-643, issn 0002-9890Article

Adding an edge in a cographNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 214-226, issn 0302-9743, isbn 3-540-31000-2, 1Vol, 13 p.Conference Paper

A conjecture of Berge about linear hypergraphs and Steiner systems S(2,4,v)GIONFRIDDO, Lucia.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 125-133, issn 0012-365XConference Paper

Improving Taguchi's packaging of fractional factorial designsROBINSON, G. K.Journal of quality technology. 1993, Vol 25, Num 1, pp 1-11, issn 0022-4065Article

  • Page / 11